منابع مشابه
Dual-tree fast exact max-kernel search
The problem of max-kernel search arises everywhere: given a query point pq , a set of reference objects Sr and some kernel K, find arg maxpr∈Sr K(pq , pr ). Max-kernel search is ubiquitous and appears in countless domains of science, thanks to the wide applicability of kernels. A few domains include image matching, information retrieval, bio-informatics, similarity search, and collaborative fil...
متن کاملFast Exact Max-Kernel Search
The wide applicability of kernels makes the problem of max-kernel search ubiquitous and more general than the usual similarity search in metric spaces. We focus on solving this problem efficiently. We begin by characterizing the inherent hardness of the max-kernel search problem with a novel notion of directional concentration. Following that, we present a method to use an O(n log n) algorithm ...
متن کاملDual-Tree Fast Gauss Transforms
Kernel density estimation (KDE) is a popular statistical technique for estimating the underlying density distribution with minimal assumptions. Although they can be shown to achieve asymptotic estimation optimality for any input distribution, cross-validating for an optimal parameter requires significant computation dominated by kernel summations. In this paper we present an improvement to the ...
متن کاملExact Exponential Time Algorithms for Max Internal Spanning Tree
We are considering the NP-hard problem of finding a spanning tree with many internal vertices. This problem is a generalization of the famous and well-studied Hamiltonian Path problem. We present an dynamic-programming approach for general and degree-bounded graphs obtaining a run times of the form O∗(cn) (c ≤ 3). The main result is an algorithm for the case with maximum degree three. It only c...
متن کاملFast kernel conditional density estimation: A dual-tree Monte Carlo approach
We describe a fast, data-driven bandwidth selection procedure for kernel conditional density estimation (KCDE). Specifically, we give aMonte Carlo dual-tree algorithm for efficient, error-controlled approximation of a cross-validated likelihood objective. While exact evaluation of this objective has an unscalableO(n2) computational cost, ourmethod is practical and shows speedup factors as high ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistical Analysis and Data Mining: The ASA Data Science Journal
سال: 2014
ISSN: 1932-1864
DOI: 10.1002/sam.11218